Estimating seed sensitivity on homogeneous alignments

We address the problem of estimating the sensitivity of seed-based similarity search algorithms. In contrast to approaches based on Markov models [18, 6, 3, 4, 10], we study the estimation based on homogeneous alignments. We describe an algorithm for counting and random generation of those alignments and an algorithm for exact computation of the sensitivity for a broad class of seed strategies. We provide experimental results demonstrating a bias introduced by ignoring the homogeneousness condition

SARS-CoV-2 receptor binding domain displayed on HBsAg virus–like particles elicits protective immunity in macaques

Authorized vaccines against SARS-CoV-2 remain less available in low- and middle-income countries due to insufficient supply, high costs, and storage requirements. Global immunity could still benefit from new vaccines using widely available, safe adjuvants, such as alum and protein subunits, suited to low-cost production in existing manufacturing facilities. Here, a clinical-stage vaccine candidate comprising a SARS-CoV-2 receptor binding domain–hepatitis B surface antigen virus–like particle elicited protective immunity in cynomolgus macaques. Titers of neutralizing antibodies (>104) induced by this candidate were above the range of protection for other licensed vaccines in nonhuman primates. Including CpG 1018 did not significantly improve the immunological responses. Vaccinated animals challenged with SARS-CoV-2 showed reduced median viral loads in bronchoalveolar lavage (~3.4 log10) and nasal mucosa (~2.9 log10) versus sham controls. These data support the potential benefit of this design for a low-cost modular vaccine platform for SARS-CoV-2 and other variants of concern or betacoronaviruses

Examination of Late Palaeolithic archaeological sites in northern Europe for the preservation of cryptotephra layers

We report the first major study of cryptotephra (non-visible volcanic ash layers) on Late Palaeolithic archaeological sites in northern Europe. Examination of 34 sites dating from the Last Termination reveals seven with identifiable cryptotephra layers. Preservation is observed in minerogenic and organic deposits, although tephra is more common in organic sediments. Cryptotephra layers normally occur stratigraphically above or below the archaeology. Nearby off-site palaeoclimate archives (peat bogs and lakes <0.3 km distant) were better locations for detecting tephra. However in most cases the archaeology can only be correlated indirectly with such cryptotephras. Patterns affecting the presence/absence of cryptotephra include geographic position of sites relative to the emitting volcanic centre; the influence of past atmospherics on the quantity, direction and patterns of cryptotephra transport; the nature and timing of local site sedimentation; sampling considerations and subsequent taphonomic processes. Overall, while tephrostratigraphy has the potential to improve significantly the chronology of such sites many limiting factors currently impacts the successful application

Application of Magnetic Nanoparticles to Gene Delivery

Nanoparticle technology is being incorporated into many areas of molecular science and biomedicine. Because nanoparticles are small enough to enter almost all areas of the body, including the circulatory system and cells, they have been and continue to be exploited for basic biomedical research as well as clinical diagnostic and therapeutic applications. For example, nanoparticles hold great promise for enabling gene therapy to reach its full potential by facilitating targeted delivery of DNA into tissues and cells. Substantial progress has been made in binding DNA to nanoparticles and controlling the behavior of these complexes. In this article, we review research on binding DNAs to nanoparticles as well as our latest study on non-viral gene delivery using polyethylenimine-coated magnetic nanoparticles

Recherche de similarités dans les séquences d'ADN (modèles et algorithmes pour la conception de graines efficaces)

Les méthodes de recherche de similarités les plus fréquemment utilisées dans le cadre de la génomique sont heuristiques. Elles se basent sur un principe de filtrage du texte qui permet de localiser les régions potentiellement similaires. Dans cette thèse, nous proposons de nouvelles définitions de filtres pour la recherche de similarités sur les séquences génomiques et des algorithmes associés pour mesurer leurs caractéristiques. Plus précisément, nous avons étudié le modèle des graines espacées, et proposé un algorithme d'évaluation de l'efficacité des graines sur des similarités d'une classe particulière (similarités dites homogènes). Nous avons également développé un algorithme général pour la mesure de l'efficacité des graines, ainsi qu'un nouveau modèle de graine appelé graine sous-ensemble, extension du modèle des graines espacées. Enfin nous donnons, dans le cadre du filtrage sans perte, une extension à l'aide de graines multiples, que nous analysons et appliquons au problème de la conception d'oligonucléotides. Nous avons réalisé et donnons accès à des outils pour la conception des filtres, ainsi que pour la recherche de similarités.Most commonly used similarity search methods in genomic sequences are heuristic ones. These are based upon text filtering that allows one to infer potential regions of similarity. This thesis proposes new filter definitions to search for similarities in genomic sequences, and fast algorithms to measure the efficiency of these filters. More precisely, we study the spaced seed model and propose an algorithm to measure the seed efficiency on similarities of a certain kind, called homogeneous similarities. A generic algorithm has also been developed to measure the seed efficiency, together with an extension of the spaced seed model called subset seed. Finally, we propose and analyze a multi-seed approach in the framework of lossless filtration, and apply it to the problem of oligonucleotide design. Several software tools have been developed to search for similarities as well as to design seed-based filters.NANCY1-SCD Sciences & Techniques (545782101) / SudocSudocFranceF

De nouvelles méthodes pour l'alignement des séquences biologiques

L'alignement de séquences biologiques est une technique fondamentale en bioinformatique, et consiste à identifier des séries de caractères similaires (conservés) qui apparaissent dans le même ordre dans les deux séquences, et à inférer un ensemble de modifications (substitutions, insertions et suppressions) impliquées dans la transformation d'une séquence en l'autre. Cette technique permet de déduire, sur la base de la similarité de séquence, si deux ou plusieurs séquences biologiques sont potentiellement homologues, donc si elles partagent un ancêtre commun, permettant ainsi de mieux comprendre l'évolution des séquences. Cette thèse aborde les problèmes de comparaison de séquences dans deux cadres différents: la détection d'homologies et le séquençage à haut débit. L'objectif de ce travail est de développer des méthodes d'alignement qui peuvent apporter des solutions aux deux problèmes suivants: i) la détection d'homologies cachées entre des protéines par comparaison de séquences protéiques, lorsque la source de leur divergence sont les mutations qui changent le cadre de lecture, et ii) le mapping de reads SOLiD (séquences de di-nucléotides chevauchantes codés par des couleurs) sur un génome de référence. Dans les deux cas, la même idée générale est appliquée: comparer implicitement les séquences d'ADN pour la détection de changements qui se produisent à ce niveau, en manipulant, en pratique, d'autres représentations (séquences de protéines, séquences de codes di-nucléotides) qui fournissent des informations supplémentaires et qui aident à améliorer la recherche de similarités. Le but est de concevoir et d'appliquer des méthodes exactes et heuristiques d'alignement, ainsi que des systemes de scores, adaptés à ces scénarios.Biological sequence alignment is a fundamental technique in bioinformatics, and consists of identifying series of similar (conserved) characters that appear in the same order in both sequences, and eventually deducing a set of modifications (substitutions, insertions and deletions) involved in the transformation of one sequence into the other. This technique allows one to infer, based on sequence similarity, if two or more biological sequences are potentially homologous, i.e. if they share a common ancestor, thus enabling the understanding of sequence evolution.This thesis addresses sequence comparison problems in two different contexts: homology detection and high throughput DNA sequencing. The goal of this work is to develop sensitive alignment methods that provide solutions to the following two problems: i) the detection of hidden protein homologies by protein sequence comparison, when the source of the divergence are frameshift mutations, and ii) mapping short SOLiD reads (sequences of overlapping di-nucleotides encoded as colors) to a reference genome. In both cases, the same general idea is applied: to implicitly compare DNA sequences for detecting changes occurring at this level, while manipulating, in practice, other representations (protein sequences, sequences of di-nucleotide codes) that provide additional information and thus help to improve the similarity search. The aim is to design and implement exact and heuristic alignment methods, along with scoring schemes, adapted to these scenarios.LILLE1-Bib. Electronique (590099901) / SudocSudocFranceF